On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
نویسندگان
چکیده
Erdős posed the problem of finding conditions on a graph G that imply t (G)= b(G), where t (G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest number of edges in a bipartite subgraph. Let δc be the least number so that any graph G on n vertices with minimum degree δcn has t (G)= b(G). Extending results of Bondy, Shen, Thomassé and Thomassen we show that 0.75 δc < 0.791. 2006 Published by Elsevier Inc.
منابع مشابه
Density Conditions For Triangles In Multipartite Graphs
We consider the problem of finding a large or dense triangle-free subgraph in a given graph G. In response to a question of P. Erdős, we prove that, if the minimum degree of G is at least 17|V (G)|/20, the largest triangle-free subgraphs are precisely the largest bipartite subgraphs in G. We investigate in particular the case where G is a complete multipartite graph. We prove that a finite trip...
متن کاملTriangle-Free Subgraphs of Random Graphs
The Andrásfai–Erdős–Sós Theorem [2] states that all triangle-free graphs on n vertices with minimum degree strictly greater than 2n/5 are bipartite. Thomassen [11] proved that when the minimum degree condition is relaxed to ( 3 + ε)n, the result is still guaranteed to be rε-partite, where rε does not depend on n. We prove best possible random graph analogues of these theorems.
متن کاملBipartite Subgraphs and the Signless Laplacian Matrix
For a connected graph G, we derive tight inequalities relating the smallest signless Laplacian eigenvalue to the largest normalised Laplacian eigenvalue. We investigate how vectors yielding small values of the Rayleigh quotient for the signless Laplacian matrix can be used to identify bipartite subgraphs. Our results are applied to some graphs with degree sequences approximately following a pow...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملBipartite subgraphs of triangle-free subcubic graphs
Suppose G is a graph with n vertices and m edges. Let n′ be the maximum number of vertices in an induced bipartite subgraph of G and let m′ be the maximum number of edges in a spanning bipartite subgraph of G. Then b(G) = m′/m is called the bipartite density of G, and b∗(G) = n′/n is called the bipartite ratio of G. This paper proves that every 2connected triangle-free subcubic graph, apart fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 96 شماره
صفحات -
تاریخ انتشار 2006